Tverberg's Transversal Conjecture and Analogues of Nonembeddability Theorems for Transversals
نویسنده
چکیده
In this paper we prove a special case of the transversal conjecture of Tverberg and Vrećica. We consider the case when the numbers of parts ri in this conjecture are powers of the same prime. We also prove some results on common transversals that generalize the classical nonembeddability theorems. We also prove an analogue of colored Tverberg’s theorem by Živaljević and Vrećica. Instead of multicolor simplices with common point it gives multicolor simplices with common m-transversal. 1. Tverberg’s transversal conjecture In this paper we prove a special case of the transversal conjecture of Tverberg and Vrećica. Conjecture 1. Let 0 ≤ m ≤ d − 1 and let S0, S1, . . . , Sm be m + 1 finite sets in R. Let |Si| = (ri − 1)(d − m + 1) + 1. Then every set Si can be partitioned into ri parts Si1, Si2, . . . , Siri so that all the sets convSij can be met by a single m-flat. This conjecture was formulated by H. Tverberg on the 1989 Symposium on Combinatorics and Geometry in Stockholm. In print it was first formulated by H. Tverberg and S. Vrećica in [7], where a special case of this conjecture was proved. In the papers [11, 12] R. Živaljević and S. Vrećica established the case of this conjecture when all ri are equal to the same prime p, if p is odd then d and m were also required to be odd. Here we prove the theorem that generalizes the results of R. Živaljević and S. Vrećica to prime powers and show that the condition that d is odd is not necessary. Besides, our proof is quite short because of using the multiplicative rule for the Euler class. We prove that this conjecture is true when the numbers ri are powers of the same prime ri = p ki , and for odd p, we also need d−m to be even. Similarly to what was done by R. Živaljević and S. Vrećica, we prove a more general topological version of this conjecture. Theorem 1. Let 0 ≤ m ≤ d−1, let ri (i = 0, . . . ,m) be powers of the same prime ri = pi. If p is odd, let d−m be even. Let for each i = 0, . . . ,m fi map continuously an (ri−1)(d−m+1)-dimensional simplex ∆i = ∆ (ri−1)(d−m+1) to R. This research was supported by the Russian Foundation for Basic Research grant No. 06-01-00648, and by the President’s of Russian Federation grant No. MK-5724.2006.1. 1
منابع مشابه
Transversals and Matroid Partition*
In sec tion 1, transversal Inatroids are assoc iated with "syste ms of di s tinct represe ntatives" (i. e., tra nsversals) and,. more generally , matc hing matroids are associated with matc hings in graphs . Th e transversal matrolds and a theore m of P. J. Higgins on disjoint transversals of a famil y of se ts , along wIth th e well-known graphIc matrold s a nd some theorems on decomposition o...
متن کاملHelly-Type Theorems for Line Transversals to Disjoint Unit Balls
We prove Helly-type theorems for line transversals to disjoint unit balls in R. In particular, we show that a family of n > 2d disjoint unit balls in R has a line transversal if, for some ordering ≺ of the balls, any subfamily of 2d balls admits a line transversal consistent with ≺. We also prove that a family of n > 4d − 1 disjoint unit balls in R admits a line transversal if any subfamily of ...
متن کاملHadwiger and Helly-type theorems for disjoint unit spheres
We prove Helly-type theorems for line transversals to disjoint unit balls in R. In particular, we show that a family of n > 2d disjoint unit balls in R has a line transversal if, for some ordering ≺ of the balls, any subfamily of 2d balls admits a line transversal consistent with ≺. We also prove that a family of n > 4d − 1 disjoint unit balls in R admits a line transversal if any subfamily of ...
متن کاملLocal equivalence of transversals in matroids
Given any system of n subsets in a matroid M , a transversal of this system is an n-tuple of elements of M , one from each set, which is independent. Two transversals differing by exactly one element are adjacent, and two transversals connected by a sequence of adjacencies are locally equivalent, the distance between them being the minimum number of adjacencies in such a sequence. We give two s...
متن کاملIndependent transversals in locally sparse graphs
Let G be a graph with maximum degree ∆ whose vertex set is partitioned into parts V (G) = V1∪ . . .∪Vr . A transversal is a subset of V (G) containing exactly one vertex from each part Vi. If it is also an independent set, then we call it an independent transversal. The local degree of G is the maximum number of neighbors of a vertex v in a part Vi, taken over all choices of Vi and v 6∈ Vi. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 38 شماره
صفحات -
تاریخ انتشار 2007